Efficient and compatible bidirectional formal language translators based on extended triple graph grammars
نویسنده
چکیده
منابع مشابه
On Modularizing Triple Graph Grammars with Rule Refinement
A Triple Graph Grammar (TGG) is a set of declarative rules describing how consistent triples of graph structures in a source, target, and correspondence domain are to be generated. This generative and high-level specification of consistency can be automatically operationalized and used to derive model generators for test case generation, forward and backward translators, and incremental model s...
متن کاملCorrectness and Completeness of Generalised Concurrent Model Synchronisation Based on Triple Graph Grammars
Triple graph grammars (TGGs) have been applied successfully for specifying and analysing bidirectional model transformations. Recently, a formal approach to concurrent model synchronisation has been presented, where source and target modifications are synchronised simultaneously. In addition to methods for update propagation, the approach includes a semi-automatic strategy for conflict resoluti...
متن کاملForschungsberichte der Fakultät IV – Elektrotechnik und Informatik Efficient Analysis and Execution of Correct and Complete Model Transformations Based on Triple Graph Grammars -Extended Version
Triple Graph Grammars are a well-established, formal and intuitive concept for the speci cation and analysis of bidirectional model transformations. In previous work we have formalized and analyzed already termination, correctness, completeness, local con uence and functional behaviour. In this paper, we show how to improve the e ciency of the execution and analysis of model transformations in ...
متن کاملA Catalogue of Optimization Techniques for Triple Graph Grammars
Bidirectional model transformation languages are typically declarative, being able to provide unidirectional operationalizations from a common specification automatically. Declarative languages have numerous advantages, but ensuring runtime efficiency, especially without any knowledge of the underlying transformation engine, is often quite challenging. Triple Graph Grammars (TGGs) are a promine...
متن کاملA Static Analysis of Non-confluent Triple Graph Grammars for Efficient Model Transformation
Triple Graph Grammars (TGGs) are a well-known bidirectional model transformation language. All actively developed TGG tools pose restrictions to guarantee efficiency (polynomial runtime), without compromising formal properties. Most tools demand confluence of the TGG, meaning that a choice between applicable rules can be freely made without affecting the final result of a transformation. This i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012